ADAPTIVE SUB-LINEAR TIME FOURIER ALGORITHMS
نویسندگان
چکیده
منابع مشابه
Adaptive sub-linear Fourier algorithms
We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k N significant Fourier coefficients from a signal of bandwidth N . Previous deterministic algorithms exhibit quadratic runtime scaling, while our algorithm scales linearly with k in the average case. Underlying our algorithm are a few simple observations relating the Fourier coeffici...
متن کاملA Multiscale Sub-linear Time Fourier Algorithm for Noisy Data
We extend the recent sparse Fourier transform algorithm of [1] to the noisy setting, in which a signal of bandwidth N is given as a superposition of k N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the β-encoders in analog-to-digital conversion [2]. The algorithm runs ...
متن کاملSub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach
We consider the problem of querying a string (or, a database) of length N bits to determine all the locations where a substring (query) of length M appears either exactly or is within a Hamming distance of K from the query. We assume that sketches of the original signal can be computed off line and stored. Using the sparse Fourier transform computation based approach introduced by Pawar and Ram...
متن کاملCombinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how to deterministically identify k of the largest magnitude frequencies of Â, and estimate their coefficients, in polynomial(k, log N) time. Randomized sublinear time algorithms which have a small (controllable) probabilit...
متن کاملSimple Linear - Time Algorithms
We present global and local algorithms for evaluating minimal xed points of dependency graphs, a general problem in xed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and \reverse list" ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Adaptive Data Analysis
سال: 2013
ISSN: 1793-5369,1793-7175
DOI: 10.1142/s1793536913500039